On the Complexity of Quantum ACC
نویسندگان
چکیده
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (up to constant depth). Based on the case q = 2, Moore [8] has shown that quantum analogs of AC(0), ACC[q], and ACC, denoted QAC (0) wf , QACC[2], QACC respectively, define the same class of operators, leaving q > 2 as an open question. Our result resolves this question, proving that QAC (0) wf = QACC[q] = QACC for all q. We also develop techniques for proving upper bounds for QACC in terms of related language classes. We define classes of languages EQACC, NQACC and BQACCQ. We define a notion of log-planar QACC operators and show the appropriately restricted versions of EQACC and NQACC are contained in P/poly. We also define a notion of log-gate restricted QACC operators and show the appropriately restricted versions of EQACC and NQACC are contained in TC(0). To do this last proof, we show that TC(0) can perform iterated addition and multiplication in certain field extensions. We also introduce the notion of a polynomial-size tensor graph and we show that families of such graphs can encode the amplitudes resulting from applying an arbitrary QACC operator to an initial state.
منابع مشابه
Optimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملCounting, fanout and the complexity of quantum ACC
We propose definitions of QAC, the quantum analog of the classical class AC of constant-depth circuits with AND and OR gates of arbitrary fan-in, and QACC[q], the analog of the class ACC[q] where Modq gates are also allowed. We prove that parity or fanout allows us to construct quantum MODq gates in constant depth for any q, so QACC[2] = QACC. More generally, we show that for any q, p > 1, MODq...
متن کاملReducing Hardware Complexity of Wallace Multiplier Using High Order Compressors Based on CNTFET
Multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. Improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. Wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and red...
متن کاملA fast wallace-based parallel multiplier in quantum-dot cellular automata
Physical limitations of Complementary Metal-Oxide-Semiconductors (CMOS) technology at nanoscale and high cost of lithography have provided the platform for creating Quantum-dot Cellular Automata (QCA)-based hardware. The QCA is a new technology that promises smaller, cheaper and faster electronic circuits, and has been regarded as an effective solution for scalability problems in CMOS technolog...
متن کامل